Optimization of Cable Cycles: A Trade-off between Reliability and Cost Master Thesis in Micro-data Analysis Author: Barsam Payvar

Source URL: www.statistics.du.se

• NP-complete problems
• Travelling salesman problem
• Induced path
• Shortest path problem
• Graph
• Routing
• Combinatorial optimization
• Path
• Hamiltonian path
• Graph theory
• Theoretical computer science
• Mathematics

First-order reasoning in Yices2 Master Thesis in Computer Science Simon Cruanes∗ supervised by Bruno Dutertre †, Viktor Kuncak ‡, Benjamin Werner § SRI International, Menlo Park, CA September 2011 – March 2012

Source URL: cedeela.fr

• Automated theorem proving
• Model theory
• Logic in computer science
• Constraint programming
• NP-complete problems
• Boolean satisfiability problem
• Satisfiability Modulo Theories
• DPLL algorithm
• Interpretation
• Theoretical computer science
• Logic
• Mathematical logic

Wedding Boolean Solvers with Superposition: a Societal Reform Simon Cruanes École polytechnique and INRIA, 23 Avenue d’Italie, 75013 Paris, France https://who.rocq.inria.fr/Simon.Cruanes/

Source URL: cedeela.fr

• NP-complete problems
• Logic in computer science
• Boolean algebra
• Electronic design automation
• Formal methods
• Satisfiability Modulo Theories
• Boolean satisfiability problem
• Solver
• Boolean data type
• Theoretical computer science
• Applied mathematics
• Mathematics

Are you done with the crossword already? How about the sudoku? Ready for more puzzles? Want to exercise more than just your vocabulary and logic skills? Then listen up: starting tomorrow in this space, we’ll be introdu

Source URL: puzzle.berkeley.edu

• Logic puzzles
• Leisure
• Recreational mathematics
• Puzzles
• Crossword
• Sudoku
• Flavor text
• Kakuro
• The New York Times crossword puzzle
• NP-complete problems
• Games
• Mathematics

The Polyhedral Model Definitions Operations on Polyhedra Quantifier Elimination and SMT solvers Last Words

Source URL: labexcompilation.ens-lyon.fr

• Electronic design automation
• Formal methods
• Logic in computer science
• NP-complete problems
• Compiler optimizations
• Polyhedron
• Satisfiability Modulo Theories
• Boolean satisfiability problem
• Linear programming
• Theoretical computer science
• Mathematics
• Applied mathematics

Hitting Set Algorithms for Fast Data Recovery in the Face of Geographic Correlated Attacks Alon Efrat Esther Ezra

Source URL: www.cims.nyu.edu

• Computational geometry
• Ε-net
• Connectivity
• NP
• Erasure code
• Planar graph
• NP-complete problems
• Dominating set
• Tutte polynomial
• Graph theory
• Theoretical computer science
• Mathematics

BRICS Basic Research in Computer Science BRICS RS-01-6 Gutin et al.: Domination Analysis of Greedy-Type Heuristics for the TSP

Source URL: www.brics.dk

• Operations research
• NP-complete problems
• Nearest neighbour algorithm
• Integer sequences
• Greedy algorithm
• Domination analysis
• Factorial
• Heuristic function
• Summation
• Mathematics
• Approximation algorithms
• Travelling salesman problem

BRICS Basic Research in Computer Science BRICS RSHangos et al.: Some Complexity Problems on Single Input Double Output Controllers Some Complexity Problems on

Source URL: www.brics.dk

• Graph
• Matching
• Bipartite graph
• Independent set
• Matroid theory
• Tutte polynomial
• Path decomposition
• Graph theory
• Mathematics
• NP-complete problems

Representing Reductions of NP-Complete Problems in Logical Frameworks — A Case Study Jatin Shah Yale University

Source URL: www.itu.dk

BRICS DS-04-5 B. Skjernaa: Exact Algorithms for Variants of Satisfiability and Colouring Problems BRICS Basic Research in Computer Science

Source URL: www.brics.dk

• NP-complete problems
• Boolean satisfiability problem
• NP-complete
• Satisfiability
• Maximum cut
• Algorithm
• Graph coloring
• 2-satisfiability
• Theoretical computer science
• Mathematics
• Applied mathematics